A Parallel Implementation of the Nonsymmetric QR Algorithm for Distributed Memory Architectures
نویسندگان
چکیده
منابع مشابه
A Parallel Implementation of the Nonsymmetric QR Algorithm for Distributed Memory Architectures
One approach to solving the nonsymmetric eigenvalue problem in parallel is to parallelize the QR algorithm. Not long ago, this was widely considered to be a hopeless task. Recent e orts have made signi cant advances, although the methods proposed up to now have su ered from scalability problems. This paper discusses an approach to parallelizing the QR algorithm that greatly improves scalability...
متن کاملA Distributed Memory Implementation of the Nonsymmetric QR Algorithm
The QR algorithm is the crux of the serial nonsymmetric eigenvalue problem. Recent eeorts to parallelize this algorithm have made signiicant advances towards solving the parallel nonsym-metric eigenvalue problem. Most methods to date suuer a scalability problem. In this talk we discuss an approach for parallelizing QR which overcomes many of the disadvantages to date. We also give insights into...
متن کاملA Parallel Implementation of the Nonsymmetric Qr Algorithm for Distributed Memory
One approach to solving the nonsymmetric eigenvalue problem in parallel is to parallelize the QR algorithm. Not long ago, this was widely considered to be a hopeless task. Recent efforts have led to significant advances, although the methods proposed up to now have suffered from scalability problems. This paper discusses an approach to parallelizing the QR algorithm that greatly improves scalab...
متن کاملA parallel implementation of the QR-algorithm
In this paper a parallel implementation of the QR algorithm for the eigenvalues of a non-Hermitian matrix is proposed. The algorithm is designed to run eeciently on a linear array of processors that communicate by accessing their neighbors' memory. A module for building such arrays, the Maryland crab, is also described.
متن کاملLAPACK Working Note # 216 : A novel parallel QR algorithm for hybrid distributed memory HPC systems ∗
A novel variant of the parallel QR algorithm for solving dense nonsymmetric eigenvalue problems on hybrid distributed high performance computing (HPC) systems is presented. For this purpose, we introduce the concept of multi-window bulge chain chasing and parallelize aggressive early deflation. The multi-window approach ensures that most computations when chasing chains of bulges are performed ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2002
ISSN: 1064-8275,1095-7197
DOI: 10.1137/s1064827597325165